Complexity classes without machines: On complete languages for UP
نویسندگان
چکیده
منابع مشابه
Random languages for nonuniform complexity classes
A language A is considered to be random for a class C if for every language B in C the fraction of the strings where A and B coincide is approximately 1/2. We show that there exist languages in DSPACE(f(n)) which are random for the non-uniform class DSPACE(g(n))=h(n), where n, g(n) and h(n) are in o(f(n)). Non-uniform complexity classes were introduced by Karp and Lipton Karp and Lipton 1980] a...
متن کاملLanguages that Capture Complexity Classes
We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes For example we show that a property of graphs respectively groups binary strings etc is in polynomial time if and only if it is expressible in the rst order language of graphs respectively groups binary strings etc together with a least xed po...
متن کاملProgramming Languages Capturing Complexity Classes
We investigate an imperative and a functional programming language. The computational power of fragments of these languages induce two hierarchies of complexity classes. Our first main theorem says that these hierarchies match, level by level, a complexity-theoretic alternating space-time hierarchy known from the literature. Our second main theorems says that a slightly different complexity-the...
متن کاملComplete Problems for Dynamic Complexity Classes
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC , the dynamic classes corresponding to relational calculus and (polynomially bounded) SQL, respectively. The first problem we show complete for Dyn-FO is a singlestep version of the circuit value problem (SSCV). Of independent interest, our construction also produces a first-order form...
متن کاملComparing Complexity Classes of Formal Languages
A property of polynomial complete languages is extended in order to better compare various classes of formal languages. We consider pairs (̂ ,,̂ 2̂ °̂ classes of languages such that there is a language L e 5?, with the property that L e ^if and / if &-\ Certain longstanding open questions in automata-based complexity have resurfaced recently due to the work on efficient reducibilities among combina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90022-9